const github.com/klauspost/compress/zstd.bestShortTableBits

8 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L23: 	bestShortTableBits = 18                      // Bits used in the short match table
		enc_best.go#L24: 	bestShortTableSize = 1 << bestShortTableBits // Size of the table
		enc_best.go#L204: 		nextHashS := hashLen(cv, bestShortTableBits, bestShortLen)
		enc_best.go#L306: 			candidateS = e.table[hashLen(cv>>8, bestShortTableBits, bestShortLen)]
		enc_best.go#L322: 				improve(&best, e.table[hashLen(cv2>>8, bestShortTableBits, bestShortLen)].offset-e.cur, s+3, uint32(cv2>>8), -1)
		enc_best.go#L385: 				h1 := hashLen(cv0, bestShortTableBits, bestShortLen)
		enc_best.go#L445: 			h1 := hashLen(cv0, bestShortTableBits, bestShortLen)
		enc_best.go#L492: 			const hashLog = bestShortTableBits